- maximum weight covering
- т. граф.покрытие с максимальным весом
English-Russian scientific dictionary. 2008.
maximum weight covering
Смотреть что такое "maximum weight covering" в других словарях:
Maximum coverage problem — The maximum coverage problem is a classical question in computer science and computational complexity theory. It is a problem that is widely taught in approximation algorithms. As input you are given several sets and a number k. The sets may have … Wikipedia
Mass versus weight — The chains on the swing hold all the child’s weight. If one were to stand behind her at the bottom of the arc and try to stop her, one would be acting against her inertia, which arises purely from mass, not weight. In everyday usage, the mass of… … Wikipedia
List of NP-complete problems — Here are some of the more commonly known problems that are NP complete when expressed as decision problems. This list is in no way comprehensive (there are more than 3000 known NP complete problems). Most of the problems in this list are taken… … Wikipedia
Independent set (graph theory) — The nine blue vertices form a maximum independent set for the Generalized Petersen graph GP(12,4). In graph theory, an independent set or stable set is a set of vertices in a graph, no two of which are adjacent. That is, it is a set I of vertices … Wikipedia
ship construction — Introduction complex of activities concerned with the design and fabrication of all marine vehicles (ship). Ship construction today is a complicated compound of art and science. In the great days of sail, vessels were designed and… … Universalium
Pole vault — Pole vaulting is an athletic field event in which a person uses a long, flexible pole (which today is usually made either of fiberglass or carbon fiber) as an aid to leap over a bar. Pole jumping competitions were known to the ancient Greeks, as… … Wikipedia
Matching (graph theory) — In the mathematical discipline of graph theory, a matching or independent edge set in a graph is a set of edges without common vertices. It may also be an entire graph consisting of edges without common vertices. Covering packing dualities… … Wikipedia
Fokker V.17 — The Fokker V.17 and its derivatives were a series of experimental monoplane Fighter aircraft produced by the Dutch aircraft company Fokker in the 1910s.V.17, was a shoulder cantilever winged monoplane with plywood covering. 110 hp Oberursel… … Wikipedia
History of the tank — This article is about the history of the tank.The prehistory of the tank [ thumb|right|Recreation of an armoured vehicle designed by Leonardo da Vinci at the Château d Amboise] The problem of advancing to attack while under fire is as old as… … Wikipedia
Matroid — In combinatorics, a branch of mathematics, a matroid ( /ˈmeɪ … Wikipedia
Piaggio P.108 — infobox Aircraft name =Piaggio P.108 type =Bomber manufacturer =Piaggio caption =Piaggio P.108 side view designer =Giovanni Casiraghi first flight =1939 introduced =1942 retired =1945 status = primary user =Regia Aeronautica more users =Luftwaffe … Wikipedia
